Recursive Markov Decision Processes and Recursive Stochastic Games
نویسندگان
چکیده
منابع مشابه
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs) are natural models for recursive systems involving both probabilistic and non-probabilistic actions. As shown recently [10], fundamental problems about such models, e.g., termination, are undecidable in general, but decidable for the important class of 1-exit RMDPs and RSSGs. These capture controlled and g...
متن کاملReachability in Recursive Markov Decision Processes
We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 112 -player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on ...
متن کاملRecursive Concurrent Stochastic Games
We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games [14, 15] to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already showed undecidability for basic questions like termination, thus we focus on the important case of single-exit ...
متن کاملRecursive Markov Chain as a Stochastic Grammar
A grammar network that resembles the RTN, but takes the topology of Markov Model is introduced. This new grammar model captures the linguistic patterns from the stochastic process of the patterns. The linguistic patterns may be derived with minimal human involvement. When grammar is viewed in Markov process, we are given a rich set of tools that can be applied to the analysis and generation of ...
متن کاملRecursive Stochastic Games with Positive Rewards
We study the complexity of a class of Markov decision processes and, more generally, stochastic games, called 1-exit Recursive Markov Decision Processes (1-RMDPs) and Simple Stochastic Games (1-RSSGs) with strictly positive rewards. These are a class of finitely presented countable-state zero-sum stochastic games, with total expected reward objective. They subsume standard finite-state MDPs and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2015
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2699431